Model-based Diagnosis and Generation of Hypothesis Space via AI Planning
نویسندگان
چکیده
The hypothesis space approach to model-based diagnosis (MBD) of discrete-event systems (DESs) finds out candidates by checking each hypothesis, this being a subset of all the possible faults of the system. The hypothesis is a candidate if, assuming that all and only the faults in the hypothesis itself are affecting the system, is consistent with the system description and the observation. In this paper first we address DES diagnosis by taking advantage of the regular structure of partially ordered hypothesis spaces. Second, we consider the problem of generating (only) physically possible hypotheses, given the DES model and independently of the specific observation. The hypothesis generation problem is encoded as a planning problem.
منابع مشابه
Combining Ai, Fdi, and Statistical Hypothesis-testing in a Framework for Diagnosis
A new framework for model based diagnosis is presented using ideas from AI, FDI, and statistical hypothesis testing. The isolation mechanism is based on AI methods, and the main advantage is that multiple faults are handled implicitly. Thus, no special care for isolation of multiple faults is needed. The methods for residual generation, developed in the field of control theory (FDI), can within...
متن کاملHypothesis Exploration for Malware Detection Using Planning
In this paper we apply AI planning to address the hypothesis exploration problem and provide assistance to network administrators in detecting malware based on unreliable observations derived from network traffic. Building on the already established characterization and use of AI planning for similar problems, we propose a formulation of the hypothesis generation problem for malware detection a...
متن کاملOptimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کاملKDMAS: A Multi-Agent System for Knowledge Discovery via Planning
In the real world, there are some domain knowledge discovery problems that can be formulated into knowledge-based planning problems, such as chemical reaction process and biological pathway discovery problems (Khan et al. 2003). A view of these domain problems can be re-cast as a planning problem, such that initial and final states are known and processes can be captured as abstract operators t...
متن کاملFrom OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation
The search space in grammar-based natural language generation tasks can get very large, which is particularly problematic when generating long utterances or paragraphs. Using surface realization with OpenCCG as an example, we show that we can effectively detect partial solutions (edges) which cannot ultimately be part of a complete sentence because of their syntactic category. Formulating the c...
متن کامل